Well-founded relation - PDFSEARCH.IO - Document Search Engine

Well-founded relation
Results: 22

#	Item
11	WS.2011 Exercises to the Lecture FSVT Prof. Dr. Klaus Madlener Add to Reading List Source URL: www-madlener.informatik.uni-kl.de Language: English - Date: 2011-12-07 06:46:14 Mathematics Well-founded relation Function
12	2002 Paper 1 Question 2 Discrete Mathematics (a) What is a well-founded relation? [2 marks] Add to Reading List Source URL: www.cl.cam.ac.uk - Date: 2014-06-09 10:17:46
13	Non-Wellfounded Mereology Abstract This paper is a systematic exploration of non-wellfounded mereology. Motivations and applications suggested in the literature are considered. Some are exotic like Borges’ Aleph, and Add to Reading List Source URL: www-bcf.usc.edu Language: English - Date: 2013-01-18 11:48:07 Predicate logic Metaphysics Simple Well-founded relation Partially ordered set Inequality Constructible universe Mathematics Mereology Logic
14	Set Theory for Computer Science Glynn Winskel [removed] c 2010 Glynn Winskel Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2010-10-21 11:47:42 Mathematical proof Mathematical induction Transfinite induction Set theory Ordinal number Well-founded relation Axiom of choice Function Zermelo–Fraenkel set theory Mathematics Mathematical logic Logic
15	Discrete Mathematics II: Set Theory for Computer Science Part IA Comp. Sci. Lecture Notes Glynn Winskel c Glynn Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2012-02-13 09:46:14 Function Mathematical proof Mathematical induction Finitary relation Well-founded relation Unification Boolean algebra Propositional calculus Principia Mathematica Mathematics Logic Mathematical logic
16	Set Theory for Veriﬁcation: II Induction and Recursion Lawrence C. Paulson Computer Laboratory, University of Cambridge April 1995 Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2003-04-29 07:49:52 Theory of computation Functions and mappings Order theory Models of computation Knaster–Tarski theorem Function Well-founded relation Lambda calculus Constructible universe Mathematics Mathematical logic Computability theory
17	Applications of inductive definitions and choice principles to program synthesis Ulrich Berger and Monika Seisenberger {u.berger,csmona}@swansea.ac.uk University of Wales Swansea Add to Reading List Source URL: www-compsci.swan.ac.uk Language: English - Date: 2006-06-27 17:59:13 Structural induction Mathematical proof Mathematical induction Well-quasi-ordering Axiom of choice Recursion Intuitionistic type theory Well-founded relation Bar induction Mathematics Mathematical logic Logic
18	Chapter 1 Introduction Add to Reading List Source URL: www.cis.upenn.edu Language: English - Date: 2004-12-08 10:33:20 Functions and mappings Model theory Order theory Equivalence relation Well-founded relation Function Binary relation Interpretation Finitary relation Mathematics Mathematical logic Logic
19	Well Founded Relations and Recursion Roger Bishop Jones Add to Reading List Source URL: www.rbjones.com Language: English - Date: 2012-09-28 15:44:05 Transitive closure Function FO Binary relation Constructible universe Recursion Transitivity Mathematics Mathematical logic Well-founded relation
20	Infinite sets that satisfy the principle of omniscience in all varieties of constructive mathematics (Draft for a talk at Types’2011, version of July 15, 2011, with minor updates September 28, 2011) Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2011-10-07 04:22:12 Set theory Constructible universe Function Well-founded relation Transfinite induction Ordinal arithmetic Continuous function Ε₀ Surreal number Mathematics Mathematical logic Ordinal numbers